An Algorithm for Merging Hyperellipsoidal Clusters
نویسنده
چکیده
This report discusses an algorithm for merging hyperellipsoidal clusters The e ective merging radius between two clusters is introduced and this measure is used to determine the order in which clusters are combined We continue to merge clusters until a desired number of clusters is reached or until the minimum e ective merging radius is larger than some predetermined threshold
منابع مشابه
REGION MERGING STRATEGY FOR BRAIN MRI SEGMENTATION USING DEMPSTER-SHAFER THEORY
Detection of brain tissues using magnetic resonance imaging (MRI) is an active and challenging research area in computational neuroscience. Brain MRI artifacts lead to an uncertainty in pixel values. Therefore, brain MRI segmentation is a complicated concern which is tackled by a novel data fusion approach. The proposed algorithm has two main steps. In the first step the brain MRI is divided to...
متن کاملMap-merging in Multi-robot Simultaneous Localization and Mapping Process Using Two Heterogeneous Ground Robots
In this article, a fast and reliable map-merging algorithm is proposed to produce a global two dimensional map of an indoor environment in a multi-robot simultaneous localization and mapping (SLAM) process. In SLAM process, to find its way in this environment, a robot should be able to determine its position relative to a map formed from its observations. To solve this complex problem, simultan...
متن کاملA partition-based algorithm for clustering large-scale software systems
Clustering techniques are used to extract the structure of software for understanding, maintaining, and refactoring. In the literature, most of the proposed approaches for software clustering are divided into hierarchical algorithms and search-based techniques. In the former, clustering is a process of merging (splitting) similar (non-similar) clusters. These techniques suffered from the drawba...
متن کاملAn Automatic Clustering Technique for Optimal Clusters
This paper proposes a simple, automatic and efficient clustering algorithm, namely, Automatic Merging for Optimal Clusters (AMOC) which aims to generate nearly optimal clusters for the given datasets automatically. The AMOC is an extension to standard k-means with a two phase iterative procedure combining certain validation techniques in order to find optimal clusters with automation of merging...
متن کاملAn Optimization K-Modes Clustering Algorithm with Elephant Herding Optimization Algorithm for Crime Clustering
The detection and prevention of crime, in the past few decades, required several years of research and analysis. However, today, thanks to smart systems based on data mining techniques, it is possible to detect and prevent crime in a considerably less time. Classification and clustering-based smart techniques can classify and cluster the crime-related samples. The most important factor in the c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994